Multivariate Convex Approximation and Least-norm Convex Data-smoothing
نویسندگان
چکیده
منابع مشابه
Piecewise Convex-Concave Approximation in the $\ell_{\infty}$ Norm
Suppose that f ∈ IR is a vector of n error-contaminated measurements of n smooth values measured at distinct and strictly ascending abscissae. The following projective technique is proposed for obtaining a vector of smooth approximations to these values. Find y minimizing ‖y− f‖∞ subject to the constraints that the second order consecutive divided differences of the components of y change sign ...
متن کاملParsimonious Least Norm Approximation
A theoretically justiiable fast nite successive linear approximation algorithm is proposed for obtaining a parsimonious solution to a corrupted linear system Ax = b + p, where the corruption p is due to noise or error in measurement. The proposed linear-programming-based algorithm nds a solution x by parametrically minimizing the number of nonzero elements in x and the error k Ax ? b ? p k 1. N...
متن کاملConvex Total Least Squares
We study the total least squares (TLS) problem that generalizes least squares regression by allowing measurement errors in both dependent and independent variables. TLS is widely used in applied fields including computer vision, system identification and econometrics. The special case when all dependent and independent variables have the same level of uncorrelated Gaussian noise, known as ordin...
متن کاملConvex Quadratic Approximation
For some applications it is desired to approximate a set of m data points in IR with a convex quadratic function. Furthermore, it is required that the convex quadratic approximation underestimate all m of the data points. It is shown here how to formulate and solve this problem using a convex quadratic function with s = (n+ 1)(n+ 2)/2 parameters, s ≤ m, so as to minimize the approximation error...
متن کاملRates of Convex Approximation
This paper deals with sparse approximations by means of convex combinations of elements from a predetermined \basis" subset S of a function space. Speciically, the focus is on the rate at which the lowest achievable error can be reduced as larger subsets of S are allowed when constructing an approximant. The new results extend those given for Hilbert spaces by Jones and Barron, including in par...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2005
ISSN: 1556-5068
DOI: 10.2139/ssrn.875615